A Two-dimensional Trim-Loss Problem with Sequencing Constraints
نویسنده
چکیده
A two-dimensional t r i m l o s s problem is con sidered in which the c u t t i n g is two-stage but there are c o n s t r a i n t s on the sequencing of the c u t t i n g of o rde rs , A method is developed in which problem reduc t i on is used to generate a set of poss ib le c u t t i n g pa t te rns at each step and an h e u r i s t i c choice made of a p a t t e r n from tha t s e t . The sequences of pa t te rns produced, a l though s l i g h t l y sub-opt imal as regards t r i m l o s s , f u l l y s a t i s f y the sequencing c o n s t r a i n t s .
منابع مشابه
The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملIntegrated approaches for generating and sequencing cutting patterns in two-dimensional cutting stock problems
This paper deals with the classical two-dimensional cutting stock problem, which consists of generating cutting patterns to produce bi rectangular items of sizes (li,wi), i=1,..,m, from rectangular objects of sizes (L,W), so that an objective is optimized, for example, the cost or trim loss. However, to cut the patterns they should be sequenced in such a way as to optimize another objective, fo...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملOne-dimensional Cutting Stock Problem (1d-csp): a Study on Data Dependent Trim Loss
A generalized approach is introduced for getting minimal trim in onedimensional cutting stock problem (1D-CSP) which occurs extensively while manufacturing of different engineering objects. Our study is especially focused on transmission tower manufacturing industry. The concept of computing total trim by using the idea of pre-defined sustainable trim has been explored in previous work of autho...
متن کامل